Commutation Relations and Markov Chains
نویسنده
چکیده
It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions whose stationary distribution is the Ewens distribution, and some birth-death chains.
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملA Sharp Analysis of the Mixing Time for Random Walk on Rooted Trees
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n steps are necessary and suffice for convergence to the stationary distribution.
متن کاملMixing Time for a Random Walk on Rooted Trees
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n2 steps are necessary and suffice for convergence to the stationary distribution.
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملC∗-algebras Arising from Dyck Systems of Topological Markov Chains
Let A be an N ×N irreducible matrix with entries in {0, 1}. We define the topological Markov Dyck shift DA to be a nonsofic subshift consisting of the 2N brackets (1, . . . , (N , )1, . . . , )N with both standard bracket rule and Markov chain rule coming from A. The subshift is regarded as a subshift defined by the canonical generators S∗ 1 , . . . , S ∗ N , S1, . . . , SN of the Cuntz-Krieger...
متن کامل